branch and bound造句
例句與造句
- Balancing two - sided assembly line based on branch and bound way
多品種混合型裝配流水線的平衡設計 - A new branch and bound algorithm for solving complex integer quadratic programs
解復雜二次整數(shù)規(guī)劃問題的新型分枝定界算法 - Branch and bound algorithm
分枝界定法 - A branch and bound algorithm for solving maximizing a concave function over weakly - efficient
弱有效集上凹函數(shù)極大問題的分枝定界算法 - Branch and bound algorithm is an important method to be used to acquire the solution of optimal problems
分支定界算法是求解優(yōu)化問題的重要方法。 - It's difficult to find branch and bound in a sentence. 用branch and bound造句挺難的
- 4 . the tsp as benchmark shows that this cluster platform can increase the branch and bound algorithm ’ s efficiency and get the optimal solution soon
計算表明,在保證求得最優(yōu)解的前提下,該平臺能很好地提高分支定界算法的效率。 - When problem scale is small , we can adopt many classical algorithms such as linear programming integer programming , branch and bound method to solve this problem
當問題規(guī)模較小時，可用線性規(guī)劃、整數(shù)規(guī)劃、動態(tài)規(guī)劃等經(jīng)典算法求解。 - This paper consists of two parts . in the first part , a new branch and bound algorithm for minimizing the nonconvex quadratic programming with box constraints is proposed
本文分兩部分，第一部分研究求解邊界約束非凸二次規(guī)劃問題的整體最優(yōu)解的分支定界算法。 - The solving tsp ( traveling salesman problem ) examples as benchmark shows that this platform can increase the branch and bound algorithm ' s efficiency and get the optimal solution sooner
計算表明，在保證求得最優(yōu)解的前提下，該平臺能很好地提高分支定界算法的效率。 - To improve the efficiency of the branch and bound technique , some heuristic principles are proposed to cut those branches that may generate global optimization solution with low probability
同時，為提高分支定界法的效率，利用啟發(fā)式規(guī)則剪去產(chǎn)生最優(yōu)解可能性很小的分支。 - In addition , in consideration of the non - convex and non - concave nature of the combinational optimization sub - problem , the branch and bound technique is adopted to obtain or approximate the global optimal solution
針對組合優(yōu)化子問題的非凸非凹性，采用分支定界法，以求得或接近全局最優(yōu)解。 - We used heuristics branch and bound algorithm in this study since scheduling of parallel machines is a np - hard problem and we proposed four heuristics optimal scheduling algorithms in this study
根據(jù)johnson算法和并行可替換機床優(yōu)化調(diào)度算法，構造了兩種可行的啟發(fā)式優(yōu)化調(diào)度算法，并通過數(shù)值計算，驗證了算法的有效性。 - In this thesis , the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency
本文設計實現(xiàn)的一種專用于計算分支定界算法的機群計算平臺,能減少分支定界算法的計算時間復雜度,提高分支定界算法的效率。 - A great significance of this article is that it changes the branch and bound algorithm and backtracking algorithm into application examples of the generic search algorithm of optimal problems advanced in this article
本文的一個重要意義是將回溯法和分支限界法這兩個傳統(tǒng)的算法策略轉變?yōu)楸疚乃岢龅耐ㄓ盟阉魉惴ǖ膽美印? - Methods such as branch and bound algorithm , mixed integer programming , transportation model and separable linear programming method have been used in recently years . others are heuristic methods like genetic algorithm
近年來求解選址模型用得較多的數(shù)學優(yōu)化方法有分支定界法、混合整數(shù)規(guī)劃法、運輸模型法、可分離線性規(guī)劃法。
更多例句： 下一頁